cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Slamin
Contact Email
slamin@unej.ac.id
Phone
-
Journal Mail Official
slamin@unej.ac.id
Editorial Address
-
Location
,
INDONESIA
Indonesian Journal of Combinatorics
Published by Indonesian Combinatorial Society
ISSN : 25412205     EISSN : -     DOI : -
Core Subject : Science,
Computer Science & IT Decision Sciences, Operations Research & Management
Indonesian Journal of Combinatorics (IJC) publishes current research articles in any area of combinatorics and graph theory such as graph labelings, optimal network problems, metric dimension, graph coloring, rainbow connection and other related topics. IJC is published by the Indonesian Combinatorial Society (InaCombS), CGANT Research Group Universitas Jember (UNEJ), and Department of Mathematics Universitas Indonesia (UI).
Arjuna Subject : -
Articles 6 Documents
 1 
Search results for , issue "Vol 5, No 1 (2021)" : 6 Documents clear
Edge irregular reflexive labeling on sun graph and corona of cycle and null graph with two vertices Irfan Setiawan; Diari Indriati
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.1.5

Abstract

Let G(V,E) be a simple and connected graph which set of vertices is V and set of edges is E. Irregular reflexive k-labeling f on G(V,E) is assignment that carries the numbers of integer to elements of graph, such that the positive integer {1,2, 3,...,ke} assignment to edges of graph and the even positive integer {0,2,4,...,2kv} assignment to vertices of graph. Then, we called as edge irregular reflexive k-labelling if every edges has different weight with k = max{ke,2kv}. Besides that, there is definition of reflexive edge strength of G(V,E) denoted as res(G), that is a minimum k that using for labeling f on G(V,E). This paper will discuss about edge irregular reflexive k-labeling for sun graph and corona of cycle and null graph, denoted by Cn ⨀ N2 and make sure about their reflexive edge strengths.
Some degree-based topological indices of triphenylene polyester Muge Togan; Aysun Yurttas Gunes; Musa Demirci; Ismail Naci Cangul
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.1.4

Abstract

Molecules can be modelled by graphs to obtain their required properties by means of only mathematical methods and formulae. In this paper, several degree-based graph indices of one of the important chemical compounds called as polyester are calculated to determine several chemical and physicochemical properties of polyester.
Total edge irregularity strength of some cycle related graphs Ramalakshmi Rajendran; Kathiresan KM
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.1.3

Abstract

An edge irregular total k-labeling f : V ∪ E → 1,2, ..., k of a graph G = (V,E) is a labeling of vertices and edges of G in such a way that for any two different edges uv and u'v', their weights f(u)+f(uv)+f(v) and f(u')+f(u'v')+f(v') are distinct. The total edge irregularity strength tes(G) is defined as the minimum k for which the graph G has an edge irregular total k-labeling. In this paper, we determine the total edge irregularity strength of new classes of graphs Cm @ Cn, Pm,n* and Cm,n* and hence we extend the validity of the conjecture tes(G) = max {⌈|E(G)|+2)/3⌉, ⌈(Δ(G)+1)/2⌉}  for some more graphs.
On Super (a,d)-edge antimagic total labeling of branched-prism graph Khairannisa Al Azizu; Lyra Yulianti; Narwen Narwen; Syafrizal Sy
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.1.2

Abstract

Let H be a branched-prism graph, denoted by H = (Cm x P2) ⊙ Ǩn for odd m, m ≥ 3 and n ≥ 1. This paper considers about the existence of the super (a,d)-edge antimagic total labeling of H, for some positive integer a and some non-negative integer d.
Computing the split domination number of grid graphs V. R. Girish; P. Usha
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.1.1

Abstract

A set D - V is a dominating set of G if every vertex in V - D is adjacent to some vertex in D. The dominating number γ(G) of G is the minimum cardinality of a dominating set D. A dominating set D of a graph G = (V;E) is a split dominating set if the induced graph (V - D) is disconnected. The split domination number γs(G) is the minimum cardinality of a split domination set. In this paper we have introduced a new method to obtain the split domination number of grid graphs by partitioning the vertex set in terms of star graphs and also we haveobtained the exact values of γs(Gm;n); m ≤ n; m,n ≤ 24:
Broader families of cordial graphs Christian Barrientos; Sarah Minion
Indonesian Journal of Combinatorics Vol 5, No 1 (2021)
Publisher : Indonesian Combinatorial Society (InaCombS)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.19184/ijc.2021.5.1.6

Abstract

A binary labeling of the vertices of a graph G is cordial if the number of vertices labeled 0 and the number of vertices labeled 1 differ by at most 1, and the number of edges of weight 0 and the number of edges of weight 1 differ by at most 1. In this paper we present general results involving the cordiality of graphs that results of some well-known operations such as the join, the corona, the one-point union, the splitting graph, and the super subdivision. In addition we show a family of cordial circulant graphs.

Page 1 of 1 | Total Record : 6

 1 

Filter by Year

2021 2021


Reset
Filter By Issues
All Issue Vol 7, No 1 (2023) Vol 6, No 2 (2022) Vol 6, No 1 (2022) Vol 5, No 2 (2021) Vol 5, No 1 (2021) Vol 4, No 2 (2020) Vol 4, No 1 (2020) Vol 3, No 2 (2019) Vol 3, No 1 (2019) Vol 2, No 2 (2018) Vol 2, No 1 (2018) Vol 1, No 2 (2017) Vol 1, No 1 (2016) More Issue